A note on cyclic codes over GR(p 2, m) of length p k
نویسندگان
چکیده
The number of self-dual cyclic codes of length pk over GR(p2,m) is determined by the nullity of a certain matrix M(pk, i1). With the aid of Genocchi numbers, we determine the nullity of M(pk, i1) and hence determine completely the number of such codes.
منابع مشابه
Hermitian Self-Dual Cyclic Codes of Length $p^a$ over $GR(p^2, s)$
In this paper, we study cyclic codes over the Galois ring GR(p, s). The main result is the characterization and enumeration of Hermitian self-dual cyclic codes of length pa over GR(p, s). Combining with some known results and the standard Discrete Fourier Transform decomposition, we arrive at the characterization and enumeration of Euclidean self-dual cyclic codes of any length over GR(p, s). S...
متن کاملPolycyclic codes over Galois rings with applications to repeated-root constacyclic codes
Cyclic, negacyclic and constacyclic codes are part of a larger class of codes called polycyclic codes; namely, those codes which can be viewed as ideals of a factor ring of a polynomial ring. The structure of the ambient ring of polycyclic codes over GR(p,m) and generating sets for its ideals are considered. It is shown that these generating sets are strong Groebner bases. A method for finding ...
متن کاملLeft dihedral codes over Galois rings ${\rm GR}(p^2,m)$
Let D2n = 〈x, y | x = 1, y = 1, yxy = x〉 be a dihedral group, and R = GR(p, m) be a Galois ring of characteristic p and cardinality p where p is a prime. Left ideals of the group ring R[D2n] are called left dihedral codes over R of length 2n, and abbreviated as left D2n-codes over R. Let gcd(n, p) = 1 in this paper. Then any left D2n-code over R is uniquely decomposed into a direct sum of conca...
متن کاملA Note on Hamming distance of constacyclic codes of length $p^s$ over $\mathbb F_{p^m} + u\mathbb F_{p^m}$
For any prime p, λ-constacyclic codes of length p over R = Fpm + uFpm are precisely the ideals of the local ring Rλ = R[x] 〈xp−λ〉 , where u = 0. In this paper, we first investigate the Hamming distances of cyclic codes of length p over R. The minimum Hamming distances of all cyclic codes of length p over R are determined. Moreover, an isometry between cyclic and α-constacyclic codes of length p...
متن کاملA note on complete classification of $(\delta+\alpha u^2)$-constacyclic codes of length $p^k$ over $\F_{p^m}+u\F_{p^m}+u^2\F_{p^m}$
For units δ and α in Fpm, the structure of (δ + αu 2)-constacyclic codes of length p over Fpm + uFpm + u 2 Fpm is studied and self-dual (δ + αu 2)constacyclic codes are analyzed.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Des. Codes Cryptography
دوره 63 شماره
صفحات -
تاریخ انتشار 2009